Shannon Entropy And Tracking Dynamic Systems Over Noisy Channels
نویسنده
چکیده
This paper is concerned with the estimation of state trajectory of linear discrete time dynamic systems subject to parametric uncertainty over the compound erasure channel that uses feedback channel intermittently. For this combined system and channel, using the data processing inequality and a robust version of the Shannon lower bound, a necessary condition on channel capacity for estimation of state trajectory at the receiver giving almost sure asymptotically zero estimation error is presented. Then, an estimation technique over the compound erasure channel that includes an encoder, decoder and a sufficient condition under which the estimation error at the receiver is asymptotically zero almost surely is presented. This leads to the conclusion that over the compound erasure channel, a condition on Shannon capacity in terms of the rate of expansion of the Shannon entropy is a necessary and sufficient condition for estimation with uniform almost sure asymptotically zero estimation error. The satisfactory performance of the proposed technique is illustrated using simulation.
منابع مشابه
Information-theoretic Cryptography
In 1949, Shannon published the paper ”Communication theory of secrecy systems”. This constituted a foundational treatment and analysis of encryption systems. He transferred the methods of information theory, originally developed as a mathematical model for communication over ”noisy” channels to the setting of cryptosystems. We give a brief introduction into his most outstanding ideas, such as t...
متن کاملEntropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کاملRobust coding for a class of sources: Applications in control and reliable communication over limited capacity channels
This paper is concerned with the control of a class of dynamical systems over finite capacity communication channels. Necessary conditions for reliable data reconstruction and stability of a class of dynamical systems are derived. The methodology is information theoretic. It introduces the notion of entropy for a class of sources, which is defined as a maximization of the Shannon entropy over a...
متن کاملAn Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets
We prove a lower estimate on the increase in entropy when two copies of a conditional random variable X|Y , with X supported on Zq = {0, 1, . . . , q − 1} for prime q, are summed modulo q. Specifically, given two i.i.d. copies (X1, Y1) and (X2, Y2) of a pair of random variables (X,Y ), with X taking values in Zq, we show H(X1 +X2 | Y1, Y2)−H(X|Y ) ≥ α(q) ·H(X|Y )(1−H(X|Y )) for some α(q) > 0, w...
متن کاملQuantum Information Chapter 10. Quantum Shannon Theory
Contents 10 Quantum Shannon Theory 1 10.1 Shannon for Dummies 2 10.1.1 Shannon entropy and data compression 2 10.1.2 Joint typicality, conditional entropy, and mutual information 6 10.1.3 Distributed source coding 8 10.1.4 The noisy channel coding theorem 9 10.2 Von Neumann Entropy 16 10.2.1 Mathematical properties of H(ρ) 18 10.2.2 Mixing, measurement, and entropy 20 10.2.3 Strong subadditivit...
متن کامل